Math 8440 -arithmetic Combinatorics -spring 2011
نویسنده
چکیده
A typical result in (additive) Ramsey theory takes the following form: if N (or {1, . . . , N} with N sufficiently large) is partitioned into finitely many classes, then at least one of these classes will contain contain a specific arithmetic structure (e.g. an arithmetic progression). The simplest example of such a result is the pigeonhole principle and one can view Ramsey theory as the study of generalizations and repeated applications of this principle. These notes follow the excellent presentations in [3], [8], [5], [7] and [6] closely.
منابع مشابه
Covering the Large Spectrum and Generalized Riesz Products
Chang’s Lemma is a widely employed result in additive combinatorics. It gives optimal bounds on the dimension of the large spectrum of probability distributions on nite abelian groups. In this note, we show how Chang’s Lemma and a powerful variant due to Bloom both follow easily from an approximation theorem for probability measures in terms of generalized Riesz products. The latter result invo...
متن کاملCoding Theory Lecture Notes
These are the notes for the 2011 Summer Tutorial on Coding Theory. I have not gone through and given citations or references for all of the results given here, but the presentation relies heavily on two sources, van Lint’s Introduction to Coding Theory and the book of Huffman and Pless Fundamentals of Error-Correcting Codes. I also used course notes written by Sebastian Pancratz from a Part II ...
متن کاملOn a Certain Generalization of the Balog-Szemerédi-Gowers Theorem
The Balog-Szemerédi-Gowers theorem has a rich history, and is a very useful tool in additive combinatorics. It began with a paper by Balog and Szemerédi [2], and then was refined by Gowers [3] to the following basic result (actually, Gowers proved somewhat more than we state here): Theorem 1 There exists an absolute constant κ > 0 such that the following holds for all finite subsets X and Y of ...
متن کاملAn Entropic Proof of Chang's Inequality
Chang’s lemma is a useful tool in additive combinatorics and the analysis of Boolean functions. Here we give an elementary proof using entropy. The constant we obtain is tight, and we give a slight improvement in the case where the variables are highly biased. 1 The lemma For S ∈ {0, 1}, let χk : {±1} n → R denote the character χS(x) = ∏ i∈S xi . For any function f : {±1} → R, we can then defin...
متن کاملHyperplane sections in arithmetic hyperbolic manifolds
In this paper, we prove that the homology groups of immersed totally geodesic hypersurfaces of compact arithmetic hyperbolic manifolds virtually inject in the homology group of the
متن کامل